Real%2DWorld Wireless Sensor Networks %2D 4th International Workshop

A secure context distribution framework for peer%2Dbased pervasive systems.

IEEE PerCom 2010 demo session Message from the demo chairs.

The NARF Architecture for Generic Personal Context Recognition.



Eighth ACM International Workshop on Data Engineering for Wireless and Mobile Access

Talk to Me%21 On Interacting with Wireless Sensor Nodes.

COOJA%2FMSPSim interoperability testing for wireless sensor networks.
Wireless sensor networks consist of many small nodes. Each node has a microprocessor, a radio chip, some sensors, and is usually battery powered which limits network lifetime. Applications of wireless sensor networks range from environmental monitoring and health-care to industrial automation and military surveillance. Since the nodes are battery powered and communication consumes more power than computation much of the research focuses on power efficient communication. One of the problems is however to measure the power consumption and communication quality. Simulation of sensor networks can greatly increase development speed and also be used for evaluating power consumption as well as communication quality. For application and system development, simulators can be used to test code functionality and find software bugs. For research experiments, simulators can be used to get easier access to fine grained results than corresponding real world experiments. One problem with simulators is
Generic Role Assignment A Uniform Middleware Abstraction for Configuration of Pervasive Systems.

COOJA%2FMSPSim interoperability testing for wireless sensor networks.
Wireless sensor networks consist of many small nodes. Each node has a microprocessor, a radio chip, some sensors, and is usually battery powered which limits network lifetime. Applications of wireless sensor networks range from environmental monitoring and health-care to industrial automation and military surveillance. Since the nodes are battery powered and communication consumes more power than computation much of the research focuses on power efficient communication. One of the problems is however to measure the power consumption and communication quality. Simulation of sensor networks can greatly increase development speed and also be used for evaluating power consumption as well as communication quality. For application and system development, simulators can be used to test code functionality and find software bugs. For research experiments, simulators can be used to get easier access to fine grained results than corresponding real world experiments. One problem with simulators is
On meeting lifetime goals and providing constant application quality.

Low overhead assignment of symbolic coordinates in sensor networks.

Seventh ACM International Workshop on Data Engineering for Wireless and Mobile Access

Design and Implementation of a Reference Model for Context Management in Mobile Ad%2DHoc Networks.

Design and Implementation of a Reference Model for Context Management in Mobile Ad%2DHoc Networks.

Integrating sensor networks in pervasive computing environments using symbolic coordinates.

Time%2DBounded and Space%2DBounded Sensing in Wireless Sensor Networks.

On Boundary Recognition without Location Information in Wireless Sensor Networks.

Sensor%2DBased Clustering for Indoor Applications.

Scalable Data Management in Evolving Networks%2C 22.10. %2D 27.10.2006

Scalable Data Management in Evolving Networks%2C 22.10. %2D 27.10.2006

On group formation for self%2Dadaptation in pervasive systems.

Versatile Support for Efficient Neighborhood Data Sharing.
Abstract. Many applications in wireless sensor networks rely on data from neighboring nodes. However, the effort for developing efficient solutions for sharing data in the neighborhood is often substantial. Therefore, we present a general-purpose algorithm for this task that makes use of the broadcast nature of radio transmission to reduce the number of packets. We have integrated this algorithm into TinyXXL, a programming language extension for data exchange. This combined system offers seamless support both for data exchange among the components of a single node and for efficient neighborhood data sharing. We show that compared to existing solutions, such as Hood, our approach further reduces the work of the application developer and provides greater efficiency. 1
Removing the memory limitations of sensor networks with flash%2Dbased virtual memory.
Virtual memory has been successfully used in different domains to extend the amount of memory available to applications. We have adapted this mechanism to sensor networks, where, traditionally, RAM is a severely constrained resource. In this paper we show that the overhead of virtual memory can be significantly reduced with compile-time optimizations to make it usable in practice, even with the resource limitations present in sensor networks. Our approach, ViMem, creates an efficient memory layout based on variable access traces obtained from simulation tools. This layout is optimized to the memory access patterns of the application and to the specific properties of the sensor network hardware. Our implementation is based on TinyOS. It includes a pre-compiler for nesC code that translates virtual memory accesses into calls of ViMem’s runtime component. ViMem uses flash memory as secondary storage. In order to evaluate our system we have modified nontrivial existing applications to make use of virtual memory. We show that its runtime overhead is small even for large data sizes.
Quantifying Network Partitioning in Mobile Ad Hoc Networks.


Migration Policies for Location%2DCentric Data Storage in Mobile Ad%2DHoc Networks.


Hypergossiping A generalized broadcast strategy for mobile ad hoc networks.
Broadcasting is a commonly used communication primitive needed by many applications and protocols in mobile ad hoc networks (MANET). Unfortunately, most broadcast solutions are tailored to one class of MANETs with respect to node density and node mobility and are unlikely to operate well in other classes. In this paper, we introduce hypergossiping, a novel adaptive broadcast algorithm that combines two strategies. Hypergossiping uses adaptive gossiping to efficiently distribute messages within single network partitions and implements an efficient heuristic to distribute them across partitions. Simulation results in ns-2 show that hypergossiping operates well for a broad range of MANETs with respect to node densities, mobility levels and network loads. Key words: MANET, adaptive broadcast, network partitioning 1
Efficient algorithms for probabilistic spatial queries in mobile ad hoc networks.

Maintaining update%2Dlinearizability for replicated information in MANETs.

FlexCup A Flexible and Efficient Code Update Mechanism for Sensor Networks.
The ability to update the program code installed on wireless sensor nodes plays an import role in the highly dynamic environments sensor networks are often deployed in. Such code update mechanisms should support flexible reconfiguration and adaptation of the sensor nodes but should also operate in an energy and time efficient manner. In this paper, we present FlexCup, a flexible code update mechanism that minimizes the energy consumed on each sensor node for the installation of arbitrary code changes. We describe two different versions of FlexCup and show, using a precise hardware emulator, that our mechanism is able to perform updates up to 8 times faster than related code update algorithms found in the literature, while consuming only an eighth of the energy.
Generic Routing Metric and Policies for WSNs.
Energy-aware algorithms have proven to be a crucial part of sensor network applications, especially if they are required to operate for extended periods of time. Among these, efficient routing algorithms are of utter importance since their effect can be experienced by all other layers. Thus, the optimization and accurate prediction of the lifetime of the system can only be performed in the presence of accurate execution models that take energy consumption into account. In this paper, we propose a generic routing metric and associated policies that encompass most other existing metrics in the literature and use this model for the optimal construction of a routing tree to the sink. We also provide experimental results that show the benefits of using our novel metric.
An Efficient Resilience Mechanism for Data Centric Storage in Mobile Ad Hoc Networks.

Hoarding location%2Dbased data using clustering.

06431 Abstracts Collection %2D%2D Scalable Data Management in Evolving Networks.

06431 Summary %2D%2D Scalable Data Management in Evolving Networks%22.
&#034;Grid&#034; computing has emerged as an important new field, distinguished from conventional distributed computing by its focus on large-scale resource sharing, innovative applications, and, in some cases, high-performance orientation. In this article, we define this new field. First, we review the &#034;Grid problem,&#034; which we define as flexible, secure, coordinated resource sharing among dynamic collections of individuals, institutions, and resources---what we refer to as virtual organizations. In such settings, we encounter unique authentication, authorization, resource access, resource discovery, and other challenges. It is this class of problem that is addressed by Grid technologies. Next, we present an extensible and open Grid architecture,inwhich protocols, services, application programming interfaces, and software development kits are categorized according to their roles in enabling resource sharing. We describe requirements that we believe any such mechanisms must satisfy and we discuss the importance of defining a compact set of intergrid protocols to enable interoperability among different Grid systems. Finally, we discuss how Grid technologies relate to other contemporary technologies, including enterprise integration, application service provider, storage service provider, and peer-to-peer computing. We maintain that Grid concepts and technologies complement and have much to contribute to these other approaches.
06431 Working Group Report on Managing and Integrating Data in P2P Databases.

User Centric Walk An Integrated Approach for Modeling the Browsing Behavior of Users on the Web.

Mobility Modeling of Outdoor Scenarios for MANETs.

Hypergossiping A Generalized Broadcast Strategy for Mobile Ad Hoc Networks.
Broadcasting is a commonly used communication primitive needed by many applications and protocols in mobile ad hoc networks (MANET). Unfortunately, most broadcast solutions are tailored to one class of MANETs with respect to node density and node mobility and are unlikely to operate well in other classes. In this paper, we introduce hypergossiping, a novel adaptive broadcast algorithm that combines two strategies. Hypergossiping uses adaptive gossiping to efficiently distribute messages within single network partitions and implements an efficient heuristic to distribute them across partitions. Simulation results in ns-2 show that hypergossiping operates well for a broad range of MANETs with respect to node densities, mobility levels and network loads. Key words: MANET, adaptive broadcast, network partitioning 1
TinyCubus a flexible and adaptive framework sensor networks.
With the proliferation of sensor networks and sensor network applications, the overall complexity of such systems is continuously increasing. Sensor networks are now heterogeneous in terms of their hardware characteristics and application requirements even within a single network. In addition, the requirements of currently supported applications are expected to change over time. All of this makes developing, deploying, and optimizing sensor network applications an extremely difficult task. In this paper, we present the architecture of TinyCubus, a flexible and adaptive cross-layer framework for TinyOSbased sensor networks that aims at providing the necessary infrastructure to cope with the complexity of such systems. TinyCubus consists of a data management framework that selects and adapts both system and data management components, a cross-layer framework that enables optimizations through cross-layer interactions, and a configuration engine that installs components dynamically. Furthermore, we show the feasibility of our architecture by describing and evaluating a code distribution algorithm that uses application knowledge about the sensor topology in order to optimize its behavior.
Hypergossiping A Generalized Broadcast Strategy for Mobile Ad Hoc Networks.
Broadcasting is a commonly used communication primitive needed by many applications and protocols in mobile ad hoc networks (MANET). Unfortunately, most broadcast solutions are tailored to one class of MANETs with respect to node density and node mobility and are unlikely to operate well in other classes. In this paper, we introduce hypergossiping, a novel adaptive broadcast algorithm that combines two strategies. Hypergossiping uses adaptive gossiping to efficiently distribute messages within single network partitions and implements an efficient heuristic to distribute them across partitions. Simulation results in ns-2 show that hypergossiping operates well for a broad range of MANETs with respect to node densities, mobility levels and network loads. Key words: MANET, adaptive broadcast, network partitioning 1
Contact%2DBased Mobility Metrics for Delay%2DTolerant Ad Hoc Networking.
Mobility plays a major role in mobile ad hoc networks (MANETs) since it stresses networking tasks such as routing on one hand but aids to increase the network capacity and to overcome network partitioning on the other hand. To benefit from node mobility, a new class of MANET protocols and applications are designed to be delay-tolerant and mobility-aided. For delay-tolerant mobility-aided networking mobility on a large time-scale is a key feature. So far, in MANETs, the mobility is investigated on a short time-scale. That is why we present novel mobility metrics that quantify a large time-scale mobility. Our approach is based on the pair-wise contacts between mobile nodes. We present a detailed statistical study of our novel metrics using the widely used random waypoint mobility model as an example. For the random waypoint model we introduce an analytical model, which allows protocol developers to analytically compute some of the designed metrics. In order to provide an easy access to these metrics in a network simulator, we provide a framework for ns-2. 1
Management and configuration issues for sensor networks.
In this paper, we define three of the key issues that need to be solved in order to provide effi- cient management and configuration of applications and system software in sensor networks: the distribution and management of roles within the network, efficient code distribution algorithms, and efficient on-the-fly code update algorithms for sensor networks. The first issue is motivated by the increasing heterogeneity of sensor network applications and their need for more complex (non-homogeneous) network topologies and structures. The second one is motivated by the intrin- sic energy constraint issues and, in general, the resource limitation of sensor networks. Finally, the third one is needed due to the nature of monitoring applications and optimization needs from applications that should be able to efficiently incorporate code updates so that the network can adapt to its surroundings on the fly. In this paper we present related work and some results for each of these issues as we have dealt with them within the TinyCubus project.
Sensornetze.
This paper is an invitation for the participants of &#034;Fachgesprach Sensornetze  &#034; to discuss security issues in sensor networks in relation to particular  projects in which the participants are involved. The central question to be discussed  is: In what sense are the applications constructed by the participants secure  ? To structure the discussion, we give a taxonomy of adversary classes for  sensor networks and give an overview over methods for securing sensor networks  against these adversaries.
TinyCubus An Adaptive Cross%2DLayer Framework for Sensor Networks %28TinyCubus Ein Adaptives Cross%2DLayer Framework f%FCr Sensornetze%29.

Generic role assignment for wireless sensor networks.
We consider configuration of wireless sensor networks, where certain functions must be automatically assigned to sensor nodes, such that the properties of a sensor node (e.g., remaining energy, network neighbors) match the requirements of the assigned function. Essentially, sensor nodes take on certain roles in the network as a result of configuration. To help developers with such configuration tasks for a variety of applications, we propose generic role assignment as a programming abstraction, where roles and rules for their assignment can be easily specified using a configuration language. We present such a role specification language and distributed algorithms for role assignment according to such specifications. We evaluate our approach and show that efficient and robust generic role assignment is practically feasible for wireless sensor networks.
Consistent Context Management in Mobile Ad Hoc Networks.

Consistent Context Management in Mobile Ad Hoc Networks.

An Enhanced Hoarding Approach Based on Graph Analysis.

04441 Working Group %2D Some Open Aspects of Mobile Ad%2Dhoc NETwork

A Fault%2DTolerant Key%2DDistribution Scheme for Securing Wireless Ad Hoc Networks.

A quantitative analysis of partitioning in mobile ad hoc networks.

Catalog Integration Made Easy.
In this paper, we study adaptive evaluation techniques for querying XMLbased  electronic catalogs, and show, by means of experiments performed on real-world  catalogs, that our approach can be used to integrate them with virtually zero effort at  start-up time, and a small constant factor needed to perform the adaptive evaluation  for all subsequent queries. We reach the conclusion that, from a strictly technical  perspective, the classic role of the global catalog can be assumed in an ad-hoc manner  by any catalog that forms part of a collaborative federation of XML-based catalogs,  and implements our adaptive query algorithms, independently of the storage model  used to access its contents.
Catalog Integration Made Easy.
In this paper, we study adaptive evaluation techniques for querying XMLbased  electronic catalogs, and show, by means of experiments performed on real-world  catalogs, that our approach can be used to integrate them with virtually zero effort at  start-up time, and a small constant factor needed to perform the adaptive evaluation  for all subsequent queries. We reach the conclusion that, from a strictly technical  perspective, the classic role of the global catalog can be assumed in an ad-hoc manner  by any catalog that forms part of a collaborative federation of XML-based catalogs,  and implements our adaptive query algorithms, independently of the storage model  used to access its contents.
Efficient Cache Answerability for XPath Queries.
The problem of cache answerability has traditionally been studied over conjunctive queries performed on top of a relational database system. However, with the proliferation of semistructured data and, in particular, of XML as the de facto standard for information interchange on the Internet, most of the assumptions and methods used for traditional systems – and cache answerability is no exception – need to be revisited from the point of view of the semistructured data and query model. In this paper, we present a formal framework for the efficient processing of XPath queries over XML documents in a cache environment that is based on the classic rewriting approach. Furthermore, we provide details on the implementation of our formal methods on top of HLCaches, anLDAPbased distributed caching system for XML, and show that our approach is more efficient than traditional query rewriting algorithms while, at the same time, supporting the full expressive power of XPath queries. Keywords: Semistructured data, cache answerability, query rewritability, XML, XPath, LDAP
Efficient Cache Answerability for XPath Queries.
The problem of cache answerability has traditionally been studied over conjunctive queries performed on top of a relational database system. However, with the proliferation of semistructured data and, in particular, of XML as the de facto standard for information interchange on the Internet, most of the assumptions and methods used for traditional systems – and cache answerability is no exception – need to be revisited from the point of view of the semistructured data and query model. In this paper, we present a formal framework for the efficient processing of XPath queries over XML documents in a cache environment that is based on the classic rewriting approach. Furthermore, we provide details on the implementation of our formal methods on top of HLCaches, anLDAPbased distributed caching system for XML, and show that our approach is more efficient than traditional query rewriting algorithms while, at the same time, supporting the full expressive power of XPath queries. Keywords: Semistructured data, cache answerability, query rewritability, XML, XPath, LDAP
Adaptive Evaluation Techniques for Querying XML%2Dbased E%2DCatalogs.
The integration of electronic catalogs (eCatalogs) is one of the most important aspects for the successful deployment of electronic commerce systems, since they are usually the only communication channel between buyers and suppliers. In this paper, we propose an XML-based global eCatalog integration platform whose query model allows us to avoid the costly problem of finding rewritings for each local eCatalog in the system, while at the same time, providing reliable answers to a wide range of XPath queries. Our implementation relies on the following characteristics to achieve its goals: the intrinsic properties of the XPath model; the applicability and efficiency of an extensible fitness function used to evaluate each answer; and the hierarchical nature of product catalogs.
LDAP%2Dbased Ontology for Information Integration.
The increase in popularity of the Internet has lead to the  proliferation of heterogeneous information systems that could be better  utilized if they operated under a common query interface. The purpose  of this paper is to describe the representation formalism of ontologies  in an LDAP-based information integration system, and to point out the  advantages of such an approach over traditional systems. The simplicity,  coherence and uniformity of the LDAP model allows us to seamlessly  integrate source data, schemata discrepancies, and semantic information  under a common framework, that is, by design, able to reconcile integration  and data processing issues.
Ontology%2Dbased Access to heterogeneous XML Data.
Abstract: With the increase in popularity of XML on the Internet, the requirements of database management systems have shifted from traditional transaction-based databases towards the kind of characteristics provided, by design, by the Lightweight Directory Access Protocol. At the same time, the design and use of a middleware to provide a common querying interface to XML-based systems has become an increasingly relevant research problem, encouraged by the fact that XML has become the de facto standard for information interchange on the Internet. The purpose of this paper is to describe the capabilities of our LDAP-based middleware that is able to transparently incorporate arbitrary XML documents, address structural discrepancies among XML data sources, and provide support for the resolution of semantic mismatches under a common framework, thanks to the simplicity, coherence and uniformity of the LDAP model.
On Processing XML in LDAP.
The proliferation of XML and its settlement as the de facto standard for information interchange in Internet, as well as the development of query languages like XPath, have lead to a paradigm transition in the Internet database world in favor of techniques based on semistructured data models. At the same time, there has been an increase in the deployment of implementations of the LDAP protocol to store the most varied information. Its data model characteristics lie closer to the semistructured model than to the relational or object model used in traditional database systems, while also o ering additional bene ts for the distribution, parallelization and o-site processing of queries. In this paper, we present the internal data representation and query model of an LDAP-based system used for the storage of XML documents and processing of XPath queries. The feasibilityofour approach, as well as its practical relevance is backed up by experimental data.
Design of a Middleware Service for Scalable Wide Area Network Applications.

The MultiView Project Object%2DOriented View Technology and Applications.

